Research on Zero-Knowledge Proof Protocol
نویسندگان
چکیده
Zero-knowledge proof protocol is a critical component of cryptography, which in recent years has raised increasing concern of many scholars.Its application field is very extensive,and it has made breakthrough progress in many aspects,including mathematics and network safety and so on. This article launches the elaboration from the concept, nature, mathematics theory, general proof process of the zeroknowledge proof , focusing on the application research of polynomial function root, graph isomorphism, cloud storage service, RFID, proxy digital signature and identity authentication etc.Finally, the direction for further research is summed up.The systematic introduction to zero-knowledge proof protocol has important theoretical guidance and practical significance on attracting more scholars involved in the research as well as expanding application fields.
منابع مشابه
A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملOn the 'composition of Zero-knowledge Proof Systems on the Composition of Z~ro· Knowledge Proof Systems
A basic question concerning zero-knowledge proof systems is whether their (sequential and/or parallel) composition is zero-knowledge too. This question is not only of natural theoretical interest, but is also of great practical importance as it concerns the use of zero-knowledge proofs as subroutines in cryptographic protocols. We prove that the original formulation of zero-knowledge as appeari...
متن کاملHonest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
This paper presents two transformations of public-coin/Arthur-Merlin proof systems which are zero-knowledge with respect to the honest verifier into (public-coin/ArthurMerlin) proof systems which are zero-knowledge with respect to any verifier. The first transformation applies only to constant-round proof systems. It builds on Damgård’s transformation (see Crypto93), using ordinary hashing func...
متن کاملIJSRD - International Journal for Scientific Research & Development| Vol. 2, Issue 02, 2014 | ISSN (online): 2321-0613
--Zero Knowledge Proof is one of the classical construct that acts as cryptographic primitive in basic multiparty protocols implementing identification schemes and secure computation. A few recent results that convert protocols working in semi-honest models to malicious models using interactive zero knowledge proofs and research on protocol implementing zero knowledge proofs in multiparty envir...
متن کاملMulti-Party CRS Generation for a NIZK Shuffle Argument Research Seminar in Cryptography
Zero-knowledge (ZK) proof [GMR85] is a cryptographic technique where a prover P convinces a verifier V that a certain statement holds without revealing any other information. This can be done as an interactive protocol between P and V but in practice it is often convenient if the protocol is non-interactive (NIZK), meaning that P will send a single message π to V who then verifies it. This has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013